G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
نویسندگان
چکیده
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a huge usage of such graphs. Constructing symmetric and semisymmetric graphs is a large and hard problem. In this paper a tool called G-graphs and based on group theory is used. We show the efficiency of this tool for constructing symmetric and semisymmetric graphs and we exhibit experimental results. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Semisymmetric cubic graphs of twice odd order
Suppose that Γ is a connected graph and G is a subgroup of the automorphism group Aut(Γ) of Γ. Then Γ is G-symmetric if G acts transitively on the arcs (and so the vertices) of Γ and Γ is G-semisymmetric if G acts edge transitively but not vertex transitively on Γ. If Γ is Aut(Γ)symmetric, respectively, Aut(Γ)-semisymmetric, then we say that Γ is symmetric, respectively, semisymmetric. If Γ is ...
متن کاملCubic Semisymmetric Graphs of Order 2p 3 Semisymmetric Graphs of Order 2p 3
A regular graph is called semisymmetric if it is edge-transitive but not vertex-transitive. It is proved that the Gray graph is the only cubic semisymmetric graph of order 2p3, where p 3 is a prime.
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملSymmetry and connectivity in G-graphs
This article presents some interesting properties about a new type of graph associated to a group, the G-graphs [4]. We show that many properties of a group can be seen on its associated G-graph and that many common graphs are G-graphs. We explain how to build efficiently some symmetric and semisymmetric graphs using the G-graphs. We establish a link beetwen Cayley graphs [1,2] and G-graphs.
متن کاملBridging Semisymmetric and Half-arc-transitive Actions on Graphs
A generalization of some of the Folkman's constructions [13] of the so called semisymmetric graphs, that is regular graphs which are edgebut not vertex-transitive, was given in [22] together with a natural connection of graphs admitting 12 -arc-transitive group actions and certain graphs admitting semisymmetric group actions. This connection is studied in more detail in this paper. In Theorem 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 156 شماره
صفحات -
تاریخ انتشار 2008